Negation as failure. II

Neg{raising: Negation as Failure?

Order and Negation as Failure

We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a convenient formulation of certain problems, which is illustrated by means of an intuitive simulation of logic programming with ordered disjunction. The simulation also supports a broader application of “ordered disjunction”...

Subset Assertions and Negation As Failure

Subset assertions provide a declarative and natural means for expressing solutions to many problems involving sets. This paper is motivated by the use of subset assertions for formulating transitive closures and solving containment constraints in applications of graph traversal and program analysis. In these applications , circular containment constraints may arise, for which we propose an oper...

Negation as Finite Failure is Paraconsistent

Paraconsistent logics are generally considered somewhat esoteric. Moreover, someone argued that they simply not exist, because paraconsistent negations are not negations. The aim of this work is to provide some valid reasons to reject both these assumptions. Negation as finite failure (NAF) is the standard way to compute negation, used, for instance, by all the known (to me) Prolog implementati...

On Positive Occurrences of Negation as Failure

Logic programs with positive occurrences of negation as failure have recently been introduced as a subset of the logic of minimal belief and negation as failure (MBNF). A unique feature of such programs, which other traditional logic programs lack, is that the minimality of answer sets does not hold. We reveal in this paper that this property is important for applying logic programming to repre...